Automated Proofs ofObject Code for aWidely Used Microprocessor 1

Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor 1

We have formally speciied a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm, i.e., the Boyer-Moore Theorem Prover 6]. Using this MC68020 specii-cation, we have mechanically checked the correctness of MC68020 machine code programs for Euclid's GCD, Hoare's Quick Sort, binary search, and other...

Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor

We have formally speci ed a substantial subset of the MC68020, a widely used microprocessor built by Motorola, within the mathematical logic of the automated reasoning system Nqthm, i.e., the Boyer-Moore Theorem Prover [4]. Using this MC68020 speci cation, we have mechanically checked the correctness of MC68020 machine code programs for Euclid's GCD, Hoare's Quick Sort, binary search, and other...

A Veri ed Compiler for a Structured Assembly LanguagePaul

We describe the veriication of a compiler for a subset of the Vista language: a structured assembly language for the Viper microprocessor. This proof has been mechanically checked using the HOL system. We consider how the compiler correctness theorem could be used to deduce safety and liveness properties of compiled code from theorems stating that these properties hold of the source code. We al...

First-Order Logic According to Harrison

We present a certified declarative first-order prover with equality based on John Harrison’s Handbook of Practical Logic and Automated Reasoning, Cambridge University Press, 2009. ML code reflection is used such that the entire prover can be executed within Isabelle as a very simple interactive proof assistant. As examples we consider Pelletier’s problems 1-46.

Automated Proofs of Object Code Fora Widely Used